Whanaungatanga: Sybil-proof routing with social networks

Decentralized systems, such as distributed hash tables, are subject to the Sybil attack, in which an adversary creates many false identities to increase its influence. This paper proposes a routing protocol for a distributed hash table that is strongly resistant to the Sybil attack. This is the first solution to this problem with sublinear run time and space usage. The protocol uses the social connections between users to build routing tables that enable Sybil-resistant distributed hash table lookups. With a social network ofnwell-connected honest nodes, the protocol can tolerate up to O(n/ logn) “attack edges” (social links from honest users to phoney identities). This means that an adversary has to fool a large fraction of the honest users before any lookups will fail. The protocol builds routing tables that containO( √ n log n) entries per node. Lookups take O(1) time. Simulation results, using social network graphs from LiveJournal, Flickr, and YouTube confirm the analytical results.